Contemporary Mathematics Whitehead Method and Genetic Algorithms
نویسندگان
چکیده
In this paper we discuss a genetic version (GWA) of Whitehead Algorithm, which is one of the basic algorithms in combinatorial group theory. It turns out that GWA is surprisingly fast and outperforms the standard Whitehead algorithm in free groups of rank > 5. Experimenting with GWA we collected an interesting numerical data that clarifies the time-complexity of Whitehead’s Problem in general. These experiments led us to several mathematical conjectures. If confirmed they will shed light on hidden mechanisms of Whitehead Method and geometry of automorphic orbits in free groups.
منابع مشابه
Solving random inverse heat conduction problems using PSO and genetic algorithms
The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملWhitehead method and Genetic Algorithms
In this paper we discuss a genetic version (GWA) of the Whitehead’s algorithm, which is one of the basic algorithms in combinatorial group theory. It turns out that GWA is surprisingly fast and outperforms the standard Whitehead’s algorithm in free groups of rank ≥ 5. Experimenting with GWA we collected an interesting numerical data that clarifies the time-complexity of the Whitehead’s Problem ...
متن کاملA Comparison Between Fourier Transform Adomian Decomposition Method and Homotopy Perturbation ethod for Linear and Non-Linear Newell-Whitehead-Segel Equations
In this paper, a comparison among the hybrid of Fourier Transform and AdomianDecomposition Method (FTADM) and Homotopy Perturbation Method (HPM) is investigated.The linear and non-linear Newell-Whitehead-Segel (NWS) equations are solved and the results arecompared with the exact solution. The comparison reveals that for the same number of componentsof recursive sequences, the error of FTADM is ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کامل